منابع مشابه
Intersecting longest paths and longest cycles: A survey
This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs embeddable in the cubic lattice of arbitrary dimension, and graphs embeddable in the triangular or hexagonal lattice of the plane are also discussed. ...
متن کاملTransversals of Longest Paths
Let lpt(G) be the minimum cardinality of a set of vertices that intersects all longest paths in a graph G. Let ω(G) be the size of a maximum clique in G, and tw(G) be the treewidth of G. We prove that lpt(G) ≤ max{1,ω(G)− 2} when G is a connected chordal graph; that lpt(G) = 1 when G is a connected bipartite permutation graph or a connected full substar graph; and that lpt(G) ≤ tw(G) for any co...
متن کاملLongest Paths in Circular Arc Graphs
We show that all maximum length paths in a connected circular arc graph have non–empty intersection.
متن کاملMaintaining Longest Paths in Cyclic Graphs
This paper reconsiders the problem of maintaining longest paths in directed graphs, which is at the core of many scheduling applications. It presents bounded incremental algorithms for arc insertion and deletion running in time O(‖δ‖ + |δ| log |δ|) on Cyclic< 0 graphs (i.e., graphs whose cycles have strictly negative lengths), where |δ| and ‖δ‖ are measures of the change in the input and output...
متن کاملHighly non-concurrent longest paths in lattices
Yasir BASHIR1,∗, Faisal NADEEM, Ayesha SHABBIR Faculty of Mathematics, COMSATS Institute of Information Technology Wah Campus, Wah Cantt, Pakistan Faculty of Mathematics, COMSATS Institute of Information Technology Lahore Campus, Lahore, Pakistan Abdus Salam School of Mathematical Sciences, GC University, 68-B, New Muslim Town, Lahore, Pakistan University College of Engineering, Sciences and Te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2013
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.02.016